EVBDD-based algorithms for integer linear programming, spectral transformation, and function decomposition
نویسندگان
چکیده
منابع مشابه
EVBDD-based algorithms for integer linear programming, spectral transformation, and function decomposition
Edge Valued Binary Decision Diagrams evbdd s are directed acyclic graphs which can represent and manipulate integer functions as e ectively as Ordered Binary Decision Di agrams obdds do for Boolean functions They have been used in logic veri cation for showing the equivalence between Boolean functions and arithmetic functions In this paper we present evbdd based algorithms for solving integer l...
متن کاملDecomposition in Integer Linear Programming
Both cutting plane methods and traditional decomposition methods are procedures that compute a bound on the optimal value of an integer linear program (ILP) by constructing an approximation to the convex hull of feasible solutions. This approximation is obtained by intersecting the polyhedron associated with the continuous relaxation, which has an explicit representation, with an implicitly def...
متن کاملRESOLUTION METHOD FOR MIXED INTEGER LINEAR MULTIPLICATIVE-LINEAR BILEVEL PROBLEMS BASED ON DECOMPOSITION TECHNIQUE
In this paper, we propose an algorithm base on decomposition technique for solvingthe mixed integer linear multiplicative-linear bilevel problems. In actuality, this al-gorithm is an application of the algorithm given by G. K. Saharidis et al for casethat the rst level objective function is linear multiplicative. We use properties ofquasi-concave of bilevel programming problems and decompose th...
متن کاملAugmentation Algorithms for Linear and Integer Linear Programming
Motivated by Bland’s linear-programming generalization of the renowned Edmonds-Karp efficient refinement of the Ford-Fulkerson maximum-flow algorithm, we present three closely related natural augmentation rules for linear and integer linear optimization. In several nice situations, we show that polynomially many augmentation steps suffice to reach an optimum. In particular, when using “discrete...
متن کاملAlgorithms for Integer Programming
• Unlike linear programming problems, integer programming problems are very difficult to solve. In fact, no efficient general algorithm is known for their solution. • Given our inability to solve integer programming problems efficiently, it is natural to ask whether such problems are inherently “hard”. Complexity theory, offers some insight on this question. It provides us with a class of probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
سال: 1994
ISSN: 0278-0070
DOI: 10.1109/43.298033